An iterative procedure for computing the maximal root of a positive matrix

On an Iterative Procedure for Obtaining the Perron Root of a Positive Matrix

Computing the Matrix Geometric Mean of Two HPD Matrices: A Stable Iterative Method

A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...

Finding the polar decomposition of a matrix by an efficient iterative method

Theobjective in this paper to study and present a new iterative method possessing high convergence order for calculating the polar decompostion of a matrix. To do this, it is shown that the new scheme is convergent and has high convergence. The analytical results are upheld via numerical simulations and comparisons.

investigating the feasibility of a proposed model for geometric design of deployable arch structures

deployable scissor type structures are composed of the so-called scissor-like elements (sles), which are connected to each other at an intermediate point through a pivotal connection and allow them to be folded into a compact bundle for storage or transport. several sles are connected to each other in order to form units with regular polygonal plan views. the sides and radii of the polygons are...

AN ALGORITHM FOR FINDING THE EIGENPAIRS OF A SYMMETRIC MATRIX

The purpose of this paper is to show that ideas and techniques of the homotopy continuation method can be used to find the complete set of eigenpairs of a symmetric matrix. The homotopy defined by Chow, Mallet- Paret and York [I] may be used to solve this problem with 2""-n curves diverging to infinity which for large n causes a great inefficiency. M. Chu 121 introduced a homotopy equation...